Deterministic blind beamforming methods
نویسنده
چکیده
| Deterministic blind beamforming algorithms try to separate superpositions of source signals impinging on a phased antenna array, by using deterministic properties of the signals or the channels such as their constant modulus or directions-of-arrival. Unlike optimal or adaptive methods, the algebraic methods discussed in this review act on a xed block of data and give closed-form expressions for beamformers by focusing on algebraic structures. This typically leads to subspace estimation and generalized eigenvalue problems.
منابع مشابه
Algebraic Methods for Deterministic Blind Beamforming
Deterministic blind beamforming algorithms try to separate superpositions of source signals impinging on a phased antenna array by using deterministic properties of the signals or the channels such as their constant modulus or directions-of-arrival. Progress in this area has been abundant over the past ten years and has resulted in several powerful algorithms. Unlike optimal or adaptive methods...
متن کاملIdentifiability results for blind beamforming in incoherent multipath with small delay spread
Several explicit identifiability results are derived for deterministic blind beamforming in incoherent multipath with small delay spread. For example, it is shown that if the sum of spatial and fractional sampling diversities exceeds two times the total number of paths, then identifiability can be guaranteed even for one symbol snapshot. The tools come from the theory of low-rank three-way arra...
متن کاملConstant Modulus Beamforming via Convex Optimization
We present novel convex-optimization-based solutions to the problem of blind beamforming of constant modulus signals, and to the related problem of linearly constrained blind beamforming of constant modulus signals. These solutions ensure global optimality and are parameter free, namely, do not contain any tuneable parameters and do not require any apriori parameter settings. The performance of...
متن کاملBlind Adaptive Beamforming Based on Constrained Constant Modulus RLS Algorithm for Smart Antennas
In this paper, we study the performance of blind adaptive beamforming algorithms for smart antennas in realistic environments. A constrained constant modulus (CCM) design criterion is described and used for deriving a recursive least squares (RLS) type optimization algorithm. Furthermore, two kinds of scenarios are considered in the paper for analyzing its performance. Simulations are performed...
متن کاملCMA beamforming for multipath correlated sources
Blind adaptive beamforming is often used in communication systems to combat co-channel interference. Among a number of techniques, the constant modulus algorithm (CMA) has proven to be an e ective tool for blind beamforming of uncorrelated signals. Unfortunately, CMA beamformers encounter problems for correlated signals and interferences. In this paper, we consider correlated co-channel input s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007